A simple proof of diffusion approximations for LBFS re-entrant lines
نویسندگان
چکیده
For a re-entrant line operating under the last-buffer–first-serve service policy, there have been two independent proofs of a heavy traffic limit theorem. The key to these proofs is to prove the uniform convergence of a critical fluid model. We give a new proof for the uniform convergence of the fluid model.
منابع مشابه
Stability of a Simple Re-entrant Line with Infinite Supply of Work — the Case of Exponential Processing Times
We consider a two machine 3 step re-entrant line, with an infinite supply of work. We assume that processing times are exponentially distributed. We show that this system is stable under LBFS priority policy.
متن کاملAnalysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy
We consider a two machine 3 step re-entrant line, with an infinite supply of work. The service discipline is last buffer first served. Processing times are independent exponentially distributed. We analyze this system, obtaining steady state behavior and sample path properties.
متن کاملDi usion Approximations for Re - Entrant Lines with aFirst - Bu er - First - Served Priority
The diiusion approximation is proved for a class of queueing networks, known as re-entrant lines, under a rst-buuer-rst-served (FBFS) service discipline. The diiusion limit for the workload process is a semi-martingale reeecting Brownian motion on a nonnegative orthant. This approximation has recently been used by Dai, Yeh and Zhou (1994) in estimating the performance measures of the re-entrant...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملHeavy Traffic Limits for Some Queueing Networks
Using a slight modification of the framework in Bramson [7] and Williams [52], we prove heavy traffic limit theorems for six families of multiclass queueing networks. The first three families are single station systems operating under first-in first-out (FIFO), generalized headof-the-line proportional processor sharing (GHLPPS) and static buffer priority (SBP) service disciplines. The next two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 34 شماره
صفحات -
تاریخ انتشار 2006